The compatible action graphs for finite cyclic 2-groups
نویسندگان
چکیده
منابع مشابه
Edge-maximality of power graphs of finite cyclic groups
We show that among all finite groups of any given order, the cyclic group of that order has the maximum number of edges in its power graph.
متن کاملFinite $p$-groups and centralizers of non-cyclic abelian subgroups
A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq Z(G)$. In this paper, we give a complete classification of finite $mathcal{CAC}$-$p$-groups.
متن کاملFinite groups all of whose proper centralizers are cyclic
A finite group $G$ is called a $CC$-group ($Gin CC$) if the centralizer of each noncentral element of $G$ is cyclic. In this article we determine all finite $CC$-groups.
متن کاملRelative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کاملOn Laplacian energy of non-commuting graphs of finite groups
Let $G$ be a finite non-abelian group with center $Z(G)$. The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$. In this paper, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups..
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Analytics and Applied Mathematics (DAAM)
سال: 2020
ISSN: 2773-4854
DOI: 10.15282/daam.v1i01.5111